Isomorphism for Graphs of Bounded Distance Width
نویسندگان
چکیده
منابع مشابه
An improved isomorphism test for bounded-tree-width graphs
We give a new fpt algorithm testing isomorphism of n-vertex graphs of tree width k in time 2 polylog(k) poly(n), improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time 2 5 log k) poly(n). Based on an improved version of the isomorphism-invariant graph decomposition technique introduced by Lokshtanov et al., we prove restrictions on the s...
متن کاملGraphs of Bounded Rank-width
We define rank-width of graphs to investigate clique-width. Rank-width is a complexity measure of decomposing a graph in a kind of tree-structure, called a rankdecomposition. We show that graphs have bounded rank-width if and only if they have bounded clique-width. It is unknown how to recognize graphs of clique-width at most k for fixed k > 3 in polynomial time. However, we find an algorithm r...
متن کاملDeciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2. W. Espelage et al., Deciding Cli...
متن کاملLine graphs of bounded clique-width
We show that a set of graphs has bounded tree-width or bounded path-width if and only if the corresponding set of line graphs has bounded clique-width or bounded linear clique-width, respectively. This relationship implies some interesting algorithmic properties and re-proves already known results in a very simpleway. It also shows that theminimization problem forNLC-width isNP-complete. © 2007...
متن کاملHardness results for isomorphism and automorphism of bounded valence graphs
In a bounded valence graph every vertex has O(1) neighbours. Testing isomorphism of bounded valence graphs is known to be in P [15], something that is not clear to hold for graph isomorphism in general. We show that testing isomorphism for undirected, directed and colored graphs of valence 2 is logspace complete. We also prove the following: If a special version of bounded valence GI is hard fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1999
ISSN: 0178-4617
DOI: 10.1007/pl00009273